Ieee Transactions on Computers , July 1970

نویسندگان

  • ERIK D. GOODMAN
  • Gianfranco R. Putzolu
چکیده

von Neumann [2], Codd [4], and others who attempt to achieve various computational goals using minimal (for example, fewest states) primitive modules. Input and output are all done from a single machine, which, while no theoretical limitation because of the lumping of finite-state machines, is a further dissimilarity between the author's arrays and practical parallel-processing computing schemes. Together, the results on the hierarchy (based on dimension) and the power of arrays with a simple stencil (only nearest neighbors) constitute a principle that having an extra dimension available is more powerful than merely having a broader reach in fewer dimensions. It might be interesting to see how this principle would be affected by placing various restrictions on the classes of finite-state machines in the array. ERIK D. GOODMAN Logic of Computers Group University of Michigan Ann Arbor, Mich.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Addition of Binary Numbers

An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit delay, and assuming that all numbers have the usual binary encoding. The upper bound is within a factor (1 + ε) of Winograd’s lower bound (which holds for all encodings), where ε → 0 as n → ∞, and only O(n log n) circuit elements are required. CommentsOnly the Abst...

متن کامل

B70-6 Computing Methods in Optimization Problems

In this section, the IEEE Computer Group publishes reviews of books in the computer field and related areas. Readers are invited to send comments on these reviews for possible publication in the Correspondence section of this TRANSACTIONS. Please address your comments and suggestions to the Book Reviews Editor: Louis A. Schmittroth, Department of Computer Science, Montana State University, Boze...

متن کامل

Implementation of Four Common Functions on an LNS Co-Processor

[9] C.-T. Ho, “ Full bandwidth communications on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. I, Penn State, 1989, pp. 276280. [IO] -, “An observation on the bisectional interconnection networks,” IEEE Trans. Compui., vol. 41, no. 7, pp. 873-877, July 1992. [ I I ] S. Latifi and A. El-Amawy, “on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. 1, Penn State, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006